Comparing Forward and Backward Reachability as Tools for Safety Analysis
نویسنده
چکیده
Using only the existence and uniqueness of trajectories for a generic dynamic system with inputs, we de ne and examine eight types of forward and backward reachability constructs. If the input is treated in a worst-case fashion, any forward or backward reach set or tube can be used for safety analysis, but if the input is treated in a best-case fashion only the backward reach tube always provides the correct results. Fortunately, forward and backward algorithms can be exchanged if wellposed reverse time trajectories can be de ned. Unfortunately, backward reachability constructs are more likely to su er from numerical stability issues, especially in systems with signi cant contraction|the very systems where forward simulation and reachability are most e ective.
منابع مشابه
Improving Reachability Analysis of Infinite State Systems by Specialization
We consider infinite state reactive systems specified by using linear constraints over the integers, and we address the problem of verifying safety properties of these systems by applying reachability analysis techniques. We propose a method based on program specialization, which improves the effectiveness of the backward and forward reachability analyses. For backward reachability our method c...
متن کاملA Combination of Forward and Backward Reachability Analysis Methods
Induction-guided falsification (IGF) is a combination of bounded model checking (BMC) and structural induction, which can be used for falsification of invariants. IGF can also be regarded as a combination of forward and backward reachability analysis methods. This is because BMC is a forward reachability analysis method and structural induction can be regarded as a backward reachability analysi...
متن کاملIntertwined Forward-Backward Reachability Analysis Using Interpolants
In this work we develop a novel SAT-based verification approach which is based on interpolation. The novelty of our approach is in extracting interpolants in both forward and backward manner and exploiting them for an intertwined approximated forward and backward reachability analysis. Our approach is also mostly local and avoids unrolling of the checked model as much as possible. This results ...
متن کاملSafety Analysis Using Coloured Petri Nets - Software Engineering Conference, 1996. Proceedings., 1996 Asia-Pacific
I n this paper, we propose a safety analysis method using coloured Petri nets (CPN). Our method employs a backward approach where a hazard is assumed to have occurred and backward simulation from the hazard is performed in order to determine i f and how the hazard might occur. Using CPN, we define a hazard as a set of markings and perform backward simulation by generating a reachability graph b...
متن کاملCounter Machines: Decidable Properties and Applications to Verification Problems
We study various generalizations of reversal-bounded multicounter machines and show that they have decidable emptiness, infiniteness, disjointness, containment, and equivalence problems. The extensions include allowing the machines to perform linear-relation tests among the counters and parameterized constants (e.g., “Is 3x 5y 2D1+9D2 < 12?”, where x; y are counters, and D1; D2 are parameterize...
متن کامل